An Efficient Informed Embedding Scheme Using Systematic Nested Block Codes over Gaussian Channel

We present a high-capacity informed embedding scheme based on a trellis structure for a nested linear block code. This scheme can embed adaptive robust watermarked messages for various applications. Instead of using randomly generated reference vectors as arc labels, this scheme uses the codewords of a nested block code to label the arcs in the trellis structure so that each codeword can carry different amounts of hidden payload. The proposed algorithm attempts to achieve two objectives: first, to minimize the modified position for each watermarked image; second, to perform the proposed embedding algorithm to minimize the amplitude distortion for these modified positions. Additionally, the proposed algorithm can perform iteration to determine a tradeoff between robustness and fidelity using numerous controllable parameters. Finally, the experimental results report the robustness and fidelity performance of this algorithm in AWGN attack channels. The experiment also simulates computational complexity and the proposed section-based informed embedding, which requires less operational complexity compared with Miller’s informed embedding. Key–Words: Data hiding, Informed embedding, Digital watermarking, Robustness